Online Bottleneck Matching Problem with Two Heterogeneous Sensors in a Metric Space
نویسندگان
چکیده
In this paper, we consider the online matching problem with two heterogeneous sensors s1 and s2 in a metric space (X,d). If request r is assigned to sensor s1, service cost of distance d(r,s1). Otherwise, s2, d(r,s2)w, where w≥1 weight s2. The goal minimize maximum cost, design an optimal algorithm competitive ratio 1+w+1w for 1≤w≤1.839, w+1+w2+6w+12 w>1.839.
منابع مشابه
Online Bottleneck Matching
We consider the online bottleneck matching problem, where k serververtices lie in a metric space and k request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. The goal is to minimize the maximum distance between any request and its server. Because no algorithm can have a competitive ratio better thanO(k) for this problem, we use resource augmenta...
متن کاملThe Online Metric Matching Problem for Doubling Metrics
In the online minimum-cost metric matching problem, we are given an instance of a metric space with k servers, and must match arriving requests to as-yet-unmatched servers to minimize the total distance from the requests to their assigned servers. We study this problem for the line metric and for doubling metrics in general. We give O(log k)competitive randomized algorithms, which reduces the g...
متن کاملA Bottleneck Matching Problem with Edge-Crossing Constraints
Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Speci cally, given n red points and n blue points in the plane, we want to construct a perfect matching between red and blue points that minimizes the length of the longest edge, while imposing a constraint that no two edges may cross each other. We show that the problem i...
متن کاملThe Power of Rejection in Online Bottleneck Matching
We consider the online matching problem, where n server-vertices lie in a metric space and n request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. We focus on the egalitarian bottleneck objective, where the goal is to minimize the maximum distance between any request and its server. It has been demonstrated that while there are effective algori...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2022
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation10120217